منابع مشابه
Existence Assumptions in Knowledge Representation
Hirst, G., Existence assumptions in knowledge representation, Artificial Intelligence 49 (1991) 199-242. If knowledge representation formalisms are to be suitable for semantic interpretation of natural language, they must be more adept with representations of existence and nonexistence than they presently are. Quantifiers must sometimes scope over nonexistent entities. I review the philosophica...
متن کاملFoundations of Management Knowledge: Assumptions and Limitations
Modern management knowledge relies overwhelmingly on the written word and it’s disseminated through print. Writing in general and alphabetic writing in particular facilitated the development of abstract thinking and the linear logic necessary for the systematic framing of individual activities into purposeful functions. In so doing it precipitated the necessary future goal-orientation required ...
متن کاملThe role of assumptions in knowledge engineering
Problem-solving methods are means to describe the inference process of knowledge-based systems. During the last years, a number of these problemsolving methods have been identified that can be reused for building new systems. However, problem-solving methods require specific types of domain knowledge and introduce specific restrictions on the tasks that can be solved by them. These requirements...
متن کاملImplicit Assumptions in Legal Knowledge Systems
n this article we address the issue of implicit assumptions in legal knowledge systems (LKBS). We illustrate that LKBSs have many underlying assumptions mostly arising during the design process. We divide these implicit assumptions over three categories: (1) assumptions about the user, (2) assumptions about the task, and (3) assumptions about the domain. Making assumptions in the design of a LK...
متن کاملConcurrent Zero Knowledge Without Complexity Assumptions
We provide unconditional constructions of concurrent statistical zero-knowledge proofs for a variety of non-trivial problems (not known to have probabilistic polynomial-time algorithms). The problems include Graph Isomorphism, Graph Nonisomorphism, Quadratic Residuosity, Quadratic Nonresiduosity, a restricted version of Statistical Difference, and approximate versions of the (coNP forms of the)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philosophical Studies
سال: 2011
ISSN: 0031-8116,1573-0883
DOI: 10.1007/s11098-011-9797-z